Graph-grammar based algorithm for asteroid tsunami simulations
نویسندگان
چکیده
On January 18, 2022, around 1 million kilometers from Earth, five times the distance Earth to Moon, a large asteroid passed without harm Earth. Theoretically, however, event of falling into causing tsunami, is possible since there are over 27,000 near-Earth asteroids [1], and Earth’s surface covered in 71 percent by water. We introduce novel graph-grammar-based framework for tsunami simulations. Our adaptively generates computational mesh model. It built triangular elements representing seashore seabed. The represented as graph, with graph vertices element’s interiors edges. Mesh refinements often performed longest-edge refinement algorithm. have expressed this algorithm only two graph-grammar productions. resulting represents terrain approximating topography prescribed accuracy. generalize work on entire model, allowing generation topography, including Having seabed we finite element method simulations wave propagation. illustrate disastrous Baltic sea.
منابع مشابه
Grammar-Based Graph Compression
We present a new graph compressor that works by recursively detecting repeated substructures and representing them through grammar rules. We show that for a large number of graphs the compressor obtains smaller representations than other approaches. Specific queries such as reachability between two nodes or regular path queries can be evaluated in linear time (or quadratic times, respectively),...
متن کاملAsteroid Impact Tsunami: A Probabilistic Hazard Assessment
We investigate the generation, propagation, and probabilistic hazard of tsunami spawned by oceanic asteroid impacts. The process first links the depth and diameter of parabolic impact cavities to asteroid density, radius, and impact velocity by means of elementary energy arguments and crater scaling rules. Then, linear tsunami theory illustrates how these transient cavities evolve into vertical...
متن کاملA Stochastic Graph Grammar Algorithm for Interactive Search
This paper presents a new search method that has been developed specifically for search trees defined by a generative grammar. Generative grammars are useful in design as a way to encapsulate the design decisions that lead to candidate solutions. Since the candidate solutions are not confined to a single configuration or topology and thus useful in conceptual design, they may be difficult to co...
متن کاملA Dependency-based Algorithm for Grammar Conversion
In this paper we present a model to transfor a grammatical formalism in another. The model is applicable only on restrictive conditions. However, it is fairly useful for many purposes: parsing evaluation, researching methods for truly combining different parsing outputs to reach better parsing performances, and building larger syntactically annotated corpora for data-driven approaches. The mode...
متن کاملPhylogenetic simulations over constraint-based grammar formalisms
Computational phylogenetics has been shown to be effective over grammatical characteristics. Recent work suggests that constraintbased formalisms are compatible with such an approach (Eden, 2013). In this paper, we report on simulations to determine how useful constraint-based formalisms are in phylogenetic research and under what conditions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Science
سال: 2022
ISSN: ['1877-7511', '1877-7503']
DOI: https://doi.org/10.1016/j.jocs.2022.101856